Removing redundancy in the expectation-maximinization algorith for Baysenian network (2000)
Source: Proceedings of the IBERAMIA / SBIA 2000. Conference titles: Workshop on Artificial Intelligence, and Computer Vision. Unidade: EP
Subjects: INTELIGÊNCIA ARTIFICIAL, PROBABILIDADE E ESTATISTICA
ABNT
COZMAN, Fabio Gagliardi. Removing redundancy in the expectation-maximinization algorith for Baysenian network. 2000, Anais.. São Paulo: Tec Art Editora, 2000. Disponível em: https://repositorio.usp.br/directbitstream/77f00321-ca6c-4ee3-adc6-f91e0037a65a/Cozman-2000-removing%20redundancy%20in%20the%20expectation%20maximization%20algorithm.pdf. Acesso em: 09 maio 2024.APA
Cozman, F. G. (2000). Removing redundancy in the expectation-maximinization algorith for Baysenian network. In Proceedings of the IBERAMIA / SBIA 2000. São Paulo: Tec Art Editora. Recuperado de https://repositorio.usp.br/directbitstream/77f00321-ca6c-4ee3-adc6-f91e0037a65a/Cozman-2000-removing%20redundancy%20in%20the%20expectation%20maximization%20algorithm.pdfNLM
Cozman FG. Removing redundancy in the expectation-maximinization algorith for Baysenian network [Internet]. Proceedings of the IBERAMIA / SBIA 2000. 2000 ;[citado 2024 maio 09 ] Available from: https://repositorio.usp.br/directbitstream/77f00321-ca6c-4ee3-adc6-f91e0037a65a/Cozman-2000-removing%20redundancy%20in%20the%20expectation%20maximization%20algorithm.pdfVancouver
Cozman FG. Removing redundancy in the expectation-maximinization algorith for Baysenian network [Internet]. Proceedings of the IBERAMIA / SBIA 2000. 2000 ;[citado 2024 maio 09 ] Available from: https://repositorio.usp.br/directbitstream/77f00321-ca6c-4ee3-adc6-f91e0037a65a/Cozman-2000-removing%20redundancy%20in%20the%20expectation%20maximization%20algorithm.pdf